A new efficient spare capacity allocation algorithm in self-healing MPLS mesh-based survivable networks

نویسندگان

  • Saeed Montazeri
  • Manijeh Keshtgary
  • Mehdi Dehghan
  • Shahram Mohrehkesh
چکیده

Network survivability gauges the ability of a network to support the committed Quality of Services (QoS) continuously in the presence of various failure scenarios. MPLS Mesh-Based network can be used to provide network survivability in case of link and node failure through predesign path protection techniques. In the Preplanned self-healing networks, we have to provision adequate spare capacity to provide fast restoration in the presence of failure. In this paper, we propose a Modified Split Backup Algorithm (MSBA) that allocates two spare backup paths for each primary path. Instead of dividing the amount of primary bandwidth path by two to obtain the required bandwidth of each backup path, we consider current reserved spare capacity values of links and calculate the fraction of spare capacity bandwidth for each backup path. We will show that our new algorithm reduces the spare capacity requirement by 3 to 13 percent in comparison with split backup method. MSBA has all of the advantages of split backup method such as the full recovery from multiple failures and avoiding the “hot spot” caused by the traffic switched from primary paths. Simulation results are used to validate the proposed model.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Spare Capacity Allocation for Non-Linear Link Cost and Failure-Dependent Path Restoration

The design of survivable mesh based communication networks has received considerable attention in recent years. One task is to route backup paths and allocate spare capacity in the network to guarantee seamless communications services survivable to a set of failure scenarios. This is a complex multi-constraint optimization problem, called spare capacity allocation (SCA). This paper presents a m...

متن کامل

Spare Capacity Planning for Survivable Mesh Networks

The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper, a new spare capacity planning methodology is proposed utilizing genetic algorithms. The method is based on forcing flows/traffic which are on paths that are disjoint to share backup spare capacity. The major advantages of the ...

متن کامل

Restoration Strategies and Spare Capacity Requirements in Self-Healing ATM Networks - Networking, IEEE/ACM Transactions on

This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the ...

متن کامل

Successive survivable routing for node failures

This paper addresses the spare capacity allocation (SCA) problem considering any single node failure in mesh networks. The SCA node failure problem aims at finding backup routes and providing sufficient spare capacity to protect traffic when any single node fails in communication network. Here, we introduce our novel matrix formulation of the arc-flow SCA node failure model. In this model, work...

متن کامل

Cycle-Oriented Distributed Preconfiguration: Ring-like Speed with Mesh-like Capacity for Self-planning Network Restoration

Cycle-oriented preconfiguration of spare capacity is a new idea for the design and operation of mesh-restorable networks. It offers a sought-after goal: to retain the capacityefficiency of a mesh-restorable network, while approaching the speed of line-switched self-healing rings. We show that through a strategy of pre-failure cross-connection between the spare links of a mesh network, it is pos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005